Optimized Sinusoid Synthesis via Inverse Truncated Fourier Transform

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synthesis of sinusoids via non-overlapping inverse Fourier transform

| Additive synthesis is a powerful tool for the analysis/modiication/synthesis of complex audio or speech signals. However, the cost of wavetable sinusoidal synthesis can become prohibitive for large numbers of sinusoids (more than a few hundred). In that case, techniques based on the inverse Fourier transform ooer an attractive alternative, being 200% to 300% more eecient than wavetable synthe...

متن کامل

The Truncated Fourier Transform andApplicationsJoris

In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminating the jumpss in the complexity at powers of two. When applied to the multiplication of multivariate polynomials or truncated multivariate power series, we gain a logarithmic factor with respect to the best previously ...

متن کامل

Notes on the Truncated Fourier Transform

In a previous paper [vdH04], we introduced a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminating the “jumps” in the complexity at powers of two. When applied to the multiplication of multivariate polynomials or truncated multivariate power series, a non-trivial asymptotic factor was gained with...

متن کامل

On the inverse windowed Fourier transform

The inversion problem concerning the windowed Fourier transform is considered. It is shown that, out of the infinite solutions that the problem admits, the windowed Fourier transform is the “optimal” solution according to a maximum-entropy selection criterion.

متن کامل

Fast Approximate Fourier Transform via Wavelets Transform

We propose an algorithm that uses the discrete wavelet transform (DWT) as a tool to compute the discrete Fourier transform (DFT). The Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. If no intermediate coeecients are dropped and no approximations are made, the proposed algorithm computes the exact result, and its computational comple...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Audio, Speech, and Language Processing

سال: 2009

ISSN: 1558-7916

DOI: 10.1109/tasl.2008.2004292